Arbitrarily Sparse Spectra for Self-Affine Spectral Measures
نویسندگان
چکیده
Given an expansive matrix R ∈ Md(ℤ) and a finite set of digit B taken from ℤd/R(ℤd). It was shown previously that if we can find L such (R, B, L) forms Hadamard triple, then the associated fractal self-affine measure generated by B) admits exponential orthonormal basis certain frequency Λ, hence it is termed as spectral measure. In this paper, show #B < ∣det(R)∣, not only spectral, also construct arbitrarily sparse spectrum Λ in sense its Beurling dimension zero.
منابع مشابه
A Class of Self-affine and Self-affine Measures
Let I = {φj}j=1 be an iterated function system (IFS) consisting of a family of contractive affine maps on Rd. Hutchinson [8] proved that there exists a unique compact set K = K(I), called the attractor of the IFS I, such that K = ⋃m j=1 φj(K). Moreover, for any given probability vector p = (p1, . . . , pm), i.e. pj > 0 for all j and ∑m j=1 pj = 1, there exists a unique compactly supported proba...
متن کاملFace Recognition using an Affine Sparse Coding approach
Sparse coding is an unsupervised method which learns a set of over-complete bases to represent data such as image and video. Sparse coding has increasing attraction for image classification applications in recent years. But in the cases where we have some similar images from different classes, such as face recognition applications, different images may be classified into the same class, and hen...
متن کاملMultifractal spectra for random self-similar measures via branching processes
Abstract Start with a compact set K ⊂ Rd. This has a random number of daughter sets each of which is a (rotated and scaled) copy of K and all of which are inside K. The random mechanism for producing daughter sets is used independently on each of the daughter sets to produce the second generation of sets, and so on, repeatedly. The random fractal set F is the limit, as n goes to infinity, of th...
متن کاملSpectral Affine-Kernel Embeddings
In this paper, we propose a controllable embedding method for highand low-dimensional geometry processing through sparse matrix eigenanalysis. Our approach is equally suitable to perform non-linear dimensionality reduction on big data, or to offer non-linear shape editing of 3D meshes and pointsets. At the core of our approach is the construction of a multi-Laplacian quadratic form that is asse...
متن کاملOn Analytical Study of Self-Affine Maps
Self-affine maps were successfully used for edge detection, image segmentation, and contour extraction. They belong to the general category of patch-based methods. Particularly, each self-affine map is defined by one pair of patches in the image domain. By minimizing the difference between these patches, the optimal translation vector of the self-affine map is obtained. Almost all image process...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analysis Mathematica
سال: 2023
ISSN: ['0133-3852', '1588-273X']
DOI: https://doi.org/10.1007/s10476-023-0191-9